'''Project Euler Problem 24

A permutation is an ordered arrangement of objects. For example, 3124
is one possible permutation of the digits 1, 2, 3 and 4. If all of the
permutations are listed numerically or alphabetically, we call it
lexicographic order. The lexicographic permutations of 0, 1 and 2 are:

                012   021   102   120   201   210

What is the millionth lexicographic permutation of the digits 0, 1, 2,
3, 4, 5, 6, 7, 8 and 9?
'''
import itertools

PERMUTENUM = 1000000
PERMUTESTR = '0123456789'

onetoten = itertools.permutations(PERMUTESTR)
for _ in xrange(PERMUTENUM - 1):
    onetoten.next()
    
print 'The answer to #24 is >>> %s <<<' % ''.join(onetoten.next())